Unsupervised and semi-supervised clustering by message passing: soft-constraint affinity propagation
نویسندگان
چکیده
منابع مشابه
Unsupervised and semi-supervised clustering by message passing: Soft-constraint affinity propagation
Soft-constraint affinity propagation (SCAP) is a new statistical-physics based clustering technique [1]. First we give the derivation of a simplified version of the algorithm and discuss possibilities of timeand memory-efficient implementations. Later we give a detailed analysis of the performance of SCAP on artificial data, showing that the algorithm efficiently unveils clustered and hierarchi...
متن کاملBeyond Affinity Propagation: Message Passing Algorithms for Clustering
Beyond Affinity Propagation: Message Passing Algorithms for Clustering Inmar-Ella Givoni Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2012 Affinity propagation is an exemplar-based clustering method that takes as input similarities between data points. It outputs a set of data points that best represent the data (exemplars), and assignments of each non-exem...
متن کاملAffinity Propagation: Clustering Data by Passing Messages
AFFINITY PROPAGATION: CLUSTERING DATA BY PASSING MESSAGES Delbert Dueck Doctor of Philosophy Graduate Department of Electrical & Computer Engineering University of Toronto 2009 Clustering data by identifying a subset of representative examples is important for detecting patterns in data and in processing sensory signals. Such “exemplars” can be found by randomly choosing an initial subset of da...
متن کاملMessage Passing for Soft Constraint Dual Decomposition
Dual decomposition provides the opportunity to build complex, yet tractable, structured prediction models using linear constraints to link together submodels that have available MAP inference routines. However, since some constraints might not hold on every single example, such models can often be improved by relaxing the requirement that these constraints always hold, and instead replacing the...
متن کاملConstraint Selection for Semi-supervised Topological Clustering
In this paper, we propose to adapt the batch version of selforganizing map (SOM) to background information in clustering task. It deals with constrained clustering with SOM in a deterministic paradigm. In this context we adapt the appropriate topological clustering to pairwise instance level constraints with the study of their informativeness and coherence properties for measuring their utility...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal B
سال: 2008
ISSN: 1434-6028,1434-6036
DOI: 10.1140/epjb/e2008-00381-8